Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms
نویسندگان
چکیده
منابع مشابه
Probabilistic Algorithms and Complexity Classes
The main theme in this dissertation is a computation on a probabilistic Turing machine (PTM), which is a Turing machine with distinguished states called coin-tossing states. In general, it is assumed that a PTM has a fair coin. This is led by that any xed biased coin can simulate another xed biased coin in a constant expected time. We rst consider the computation which will always terminates in...
متن کاملHybrid Probabilistic Programs: Algorithms and Complexity
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the de pendencies between events being described in the program. In this paper, we classify HPPs into three classes called H P P1, H P P2 and H P Pr, r 2: 3. For these classes, we pro vide three types of results for HPPs. First, we develop algorithms to compute the set of al...
متن کاملProbabilistic complexity analysis of incremental DFT algorithms
We present a probabilistic complexity analysis of a class of multi-stage algorithms for computing successive approximations to the DFT. While the quality of the approximate spectra obtained after any stage of these algorithms can be readily quanti ed in terms of commonly used inputindependent metrics of spectral quality, each stage's arithmetic complexity is dependent on the nature of the input...
متن کاملAlgorithms and Complexity Results for Discrete Probabilistic Reasoning Tasks
Many solutions to problems in machine learning and artificial intelligence involve solving a combinatorial optimization problem over discrete variables whose functional dependence is conveniently represented by a graph. This thesis addresses three types of these combinatorial optimization problems, namely, the maximum a posteriori inference in discrete probabilistic graphical models, the select...
متن کاملColloquium Complexity and robustness
Highly optimized tolerance (HOT) was recently introduced as a conceptual framework to study fundamental aspects of complexity. HOT is motivated primarily by systems from biology and engineering and emphasizes, (i) highly structured, nongeneric, self-dissimilar internal configurations, and (ii) robust yet fragile external behavior. HOT claims these are the most important features of complexity a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2008
ISSN: 0363-0129,1095-7138
DOI: 10.1137/060668407